Exact Diagonalization of HeisenbergSU(N)Models
نویسندگان
چکیده
منابع مشابه
Accelerated convergence in exact-diagonalization studies.
A simple method is proposed and tested for obtaining accelerated convergence of quantum systems on small lattices with N sites. The main idea is to perform exact diagonalizations with some added irrelevant parameter, and use this parameter to accelerate the convergence to the infinitelattice limit. In this paper di8'erent boundary conditions are used to improve the convergence for the Heisenber...
متن کاملExact diagonalization and Quantum Monte Carlo studies of quantum dots
We report exact diagonalization and diffusion quantum Monte Carlo calculations of quantum dots (QDs) in which energetics due to electron-electron interactions, magnetic field, and geometrical factors compete and induce interesting ground state configurations. The geometrical effects are generated by different confining potentials such as parabolic shaped, ring shaped, and disordered potentials....
متن کاملExact-diagonalization study of the one-dimensional disordered XXZ model.
We investigate the one-dimensional quantum XXZ model in the presence of diagonal disorder. Recently the model has been analyzed with the help of field-theoretical renormalization group methods, and a phase diagram has been predicted. We study the model with exact diagonalization techniques up to chain lengths of 16 sites. Using finite-size scaling methods we estimate critical exponents and the ...
متن کاملExact diagonalization studies of doped Heisenberg spin rings
Motivated bymagnetization studies of the “telephon number compound” Sr14Cu24O41 we investigate doped Heisenberg spin rings by means of complete numerical diagonalization of a Heisenberg Hamiltonian that depends parametrically on hole positions. A comparison with experimental magnetization data reveals rather accurate information about the screened electrostatic interaction between the charged h...
متن کاملReducing Memory Cost of Exact Diagonalization using Singular Value Decomposition
We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, without restricting to variational ansatzes. The lattice of size N is partitioned into two subclusters. At each iteration the Lanczos vector is projected into two sets of n(svd) smaller subcluster vectors using singular value decomposition. For low entanglement entropy S(ee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2014
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.113.127204